Improved Approximation of Layout Problems on Random Graphs
نویسندگان
چکیده
منابع مشابه
Improved approximation of layout problems on random graphs
Inspired by previous work of Diaz, Petit, Serna, and Trevisan (Approximating layout problems on random graphs Discrete Mathematics, 235, 2001, 245–253), we show that several well-known graph layout problems are approximable to within a factor arbitrarily close to 1 of the optimal with high probability for random graphs drawn from an ErdösRenyi distribution with appropriate sparsity conditions. ...
متن کاملApproximating Layout Problems on Random Geometric Graphs
In this paper, we study the approximability of several layout problems on a family of random geometric graphs. Vertices of random geometric graphs are randomly distributed on the unit square and are connected by edges whenever they are closer than some given parameter. The layout problems that we consider are: Bandwidth, Minimum Linear Arrangement, Minimum Cut Width, Minimum Sum Cut, Vertex Sep...
متن کاملApproximating layout problems on random graphs
We show that, with overwhelming probability, several well known layout problems are approximable within a constant for random graphs drawn from the G(n, pn) model where C/n ≤ pn ≤ 1 for all n big enough and for some properly characterized parameter C > 1. In fact, our results establish that, with overwhelming probability, the cost of any arbitrary layout of such a random graph is within a const...
متن کاملLayout Problems on Lattice Graphs
This work deals with bounds on the cost of layout problems for lattice graphs and random lattice graphs. Our main result in this paper is a convergence theorem for the optimal cost of the Minimum Linear Arrangement problem and the Minimum Sum Cut problem, for the case where the underlying graph is obtained through a subcritical site percolation process. This result can be viewed as an analogue ...
متن کاملPercolation-type Problems on Infinite Random Graphs
We study some percolation problems on the complete graph over N. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability, such as independency, is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Journal of Discrete Mathematics
سال: 2020
ISSN: 2161-7635,2161-7643
DOI: 10.4236/ojdm.2020.101003